PACKING DIMENSIONS OF GENERALIZED RANDOM MORAN SETS
نویسندگان
چکیده
منابع مشابه
Glass transition and random close packing above three dimensions.
Motivated by a recently identified severe discrepancy between a static and a dynamic theory of glasses, we numerically investigate the behavior of dense hard spheres in spatial dimensions 3 to 12. Our results are consistent with the static replica theory, but disagree with the dynamic mode-coupling theory, indicating that key ingredients of high-dimensional physics are missing from the latter. ...
متن کاملStochastic Evolution as a Generalized Moran Process
This paper proposes and analyzes a model of stochastic evolution in finite populations. The expected motion in our model resembles the standard replicator dynamic when the population is large, but is qualitatively different when the population size is small, due to the difference between maximizing payoff and maximizing relative payoff. Moreover, even in large populations the asymptotic behavio...
متن کاملCommon Ancestors in a Generalized Moran model
The Moran model is used in population genetics as a simple way to describe the stochastic evolution of a biological population. The model assumes that the population has a fixed size N and that it evolves through random reproduction events, in which one individual dies and is replaced by a newborn. Parents of the newborn individual are chosen at random from the population. In the classical Mora...
متن کاملPacking sets of patterns
Packing density is a permutation occurrence statistic which describes the maximal number of permutations of a given type that can occur in another permutation. In this article we focus on containment of sets of permutations. Although this question has been tangentially considered previously, this is the first systematic study of it. We find the packing density for various special sets of permut...
متن کاملGeneralized selfish bin packing
Standard bin packing is the problem of partitioning a set of items with positive sizes no larger than 1 into a minimum number of subsets (called bins) each having a total size of at most 1. In bin packing games, an item has a positive weight, and given a valid packing or partition of the items, each item has a cost or a payoff associated with it. We study a class of bin packing games where the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Korean Mathematical Society
سال: 2014
ISSN: 0304-9914
DOI: 10.4134/jkms.2014.51.5.1075